Linear Algebraic Techniques for Spanning Tree Enumeration
نویسندگان
چکیده
منابع مشابه
Relation-Algebraic Derivation of Spanning Tree Algorithms
We use Tarski's relational algebra to derive a series of algorithms for computing spanning trees of undirected graphs, including a variant of Prim's minimum spanning tree algorithm.
متن کاملSpanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator S is minimal if it contains no other separator as a strict subset and a minimum vertex separator is a minimal vertex separator of least cardinality. A clique is a set of mutually adjacent vertices. A 2-tree is a connected graph in which every maximal clique is of size...
متن کاملComplexity of Computation of a Spanning Tree Enumeration Algorithm
Absrracr -In l!X3, Char [4] presented an algorithm to enumerate all the spanning trees of an undirected graph G. This algorithm starts with a known initial spanning tree of G, and generates all the other spanning trees along with certain spanning non-tree subgraphs of G. In this paper a detailed complexity analysis of char’s algorithm and methods to speed up the algorithm are discussed. Two heu...
متن کاملCritical Analysis of the Spanning Tree Techniques
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be useful in computational electromagnetics. The aim of this paper is to give a rigorous description of the GSTT in terms of homology and cohomology theories, together with an analysis of its termination. In particular, the ...
متن کاملAlgebraic Techniques for Linear Deterministic Networks
We here summarize some recent advances in the study of linear deterministic networks, recently proposed as approximations for wireless channels. This work started by extending the algebraic framework developed for multicasting over graphs in [1] to include operations over matrices and to admit both graphs and linear deterministic networks as special cases. Our algorithms build on this generaliz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The American Mathematical Monthly
سال: 2020
ISSN: 0002-9890,1930-0972
DOI: 10.1080/00029890.2020.1708171